Nowadays, the fundamental role of having a purpose for life in physical and mental health has been confirmed. According to victor frankl, presence of a purpose in life gives life a meaning and increases resilience against pains and traumas. The importance of the purpose in life construct reveals the need for a reliable and valid tool to measure it. Crumbaugh and Maholick's purpose in life questionnaire is the first and one of the most applied tools for the assessment of life's purposefulness. The aim of this research is to determine the factor structure of purpose in life questionnaire. The questionnaire was administered on 206 students who were selected through random stratified sampling at Ferdowsi University of Mashhad. Exploratory factor analysis showed that there are two factors "comprehension" and "purpose" and this finding were confirmed by confirmatory factor analysis. Altogether results of this research showed factor validity of the purpose in life questionnaire with a two factor pattern

A dictionary machine is a database of (key, record) pairs with a given set of operators. Typical operators include insert, delete, delete record with minimum key, delete record with maximum key, record with minimum key, record with maximum key, nearest record, predecessor, successor, rank, and count. The different implementations of dictionary machines for Distributed memory multiprocessor computers are reported in the literature. The stored chain, balanced cube, banyan heap are some examples. Binary search mesh is a concurrent data structure for dictionary machine for implementation of dictionary machines on the Distributed memory multiprocessor computers with mesh or hypercube topologies. The implementation of binary search mesh which is given in [24] has some problems: hole is created in the insert operation, properties of the binary search mesh are not preserved in delete operation, mesh is not balanced, and data structure has low throughput. In [4] the balanced binary search mesh has proposed which doesn"t create hole in the insert operator and preserve the binary search mesh in the delete operator. In this paper, we propose the complete binary search mesh, which solve problems in binary search mesh and balanced binary search mesh. In this data structure, the levels of mesh are filled in the increasing order, which improves the throughput of data structure. For implementation of this data structure on the mesh or hypercube, the machine logically consists of two different non-disjoint networks: broadcasting network for sending operators and sending network for sending the responses, which reduce the overall traffic of the network. Comparison of complete binary search mesh with other dictionary machines implemented on the Distributed memory multi processor computers with mesh topology shows that the complete binary search mesh has higher throughput.

Plastic hinge properties play a crucial role in predicting the nonlinear response of structural elements. The plastic hinge region of reinforced concrete normal beams has been previously studied experimentally and analytically. The main objective of this research is to evaluate the behavior of the plastic hinge region of reinforced concrete deep beams and its comparison with normal beams through finite element simulation. To do so, ten beams contain six deep beams, and four normal beams, under concentrated and uniformly Distributed loading, are investigated. Lengths in the plastic hinge region involving curvature localization, rebar yielding, and concrete crushing zones are studied. The results indicate that the curvature localization zone is not suitable for the prediction of plastic hinge length in reinforced concrete deep beams. Based on the results it can be stated that in simply supported normal beams the concrete crushing zone is focused on the middle span, but in simply supported deep beams by creating a compression strut between loading place and support, the concrete crushing zone spreads along the compression trajectory. The rebar yielding zone of simply supported beams increases as the loading type is changed from the concentrated load at the middle to the uniformly Distributed load.

Modeling and simulation of communication circuits at high frequency are important challenges ahead in the design and construction of these circuits. Knowing the fact that the lumped element model is not valid at high frequency, Distributed analysis is presented based on active and passive transmission lines theory. In this paper, a lossy transmission line model of traveling wave switch (TWSW) is presented and fully Distributed analysis of this structure is also introduced. In the off state, the ordinary single pole single throw (SPST) switches operate as short or open circuit and return an observable part of the signal. To improve return loss in the off state, a non-uniform structure of SPST switches is proposed which is based on the artificial tapered transmission line produced by applying various controlling voltage at the gate. The analysis of ordinary and improved structure of SPST switches is performed and it is further compared with that of the semi-Distributed and fully Distributed methods. The results of simulation easily approve the improvement of matching in the off state.

In this paper, using only 32 MEMS switches, a new design for 6 bit DMTL phase shifter is proposed. The reduction in number of switches in ordinary 6 bit phase shifter from 63 to 32 is due to combination of one 5. 625 degree for least significant bit and 11. 25 degree for the rest of the switches. In new proposed method, the die size and loss of the CPW line reduced by decreasing the number of the switches. Analytical and finite element simulation with HFSS and COMSOL software, is used for considering the performance of the proposed structure. The results showed that, maximum return loss of phase shifter and mean RMS phase error are-10. 5 dB and1. 4o, respectively. Although two different micro switches are used but the pull in voltages are identical. The final configuration size is 1. 5 × 18. 5 mm2, and surface micromachining process is suggested for the phase shifter manufacturing.

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traffic and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traffic in the router increases or when employed for IPv6 address lookups. In this paper, we describe a high performance parallel IP lookup mechanism based on Distributed memory organization that uses P processor for solving LPM problem. Since multiple processors are used, the number of prefixes to be compared for each processor has been reduced. In other words each processor needs to find LPM for a specific IP address among N/P of prefixes. In order to reduce the number of memory access in each processor which is a major bottleneck in IP lookup process, we use ISCB-Tree data structure for the sake of storing the forwarding table in each processor. ISCB-Tree is a B-Tree like data structure that reduces the height of prefix tree and logarithmic growing manner with the increasing number of prefixes. By the using of this data structure the number of memory access reduces sharply.